全文获取类型
收费全文 | 3299篇 |
免费 | 239篇 |
国内免费 | 6篇 |
学科分类
工业技术 | 3544篇 |
出版年
2024年 | 3篇 |
2023年 | 42篇 |
2022年 | 27篇 |
2021年 | 127篇 |
2020年 | 102篇 |
2019年 | 98篇 |
2018年 | 101篇 |
2017年 | 107篇 |
2016年 | 133篇 |
2015年 | 113篇 |
2014年 | 153篇 |
2013年 | 218篇 |
2012年 | 233篇 |
2011年 | 275篇 |
2010年 | 204篇 |
2009年 | 190篇 |
2008年 | 188篇 |
2007年 | 164篇 |
2006年 | 160篇 |
2005年 | 110篇 |
2004年 | 95篇 |
2003年 | 94篇 |
2002年 | 55篇 |
2001年 | 36篇 |
2000年 | 34篇 |
1999年 | 41篇 |
1998年 | 108篇 |
1997年 | 66篇 |
1996年 | 38篇 |
1995年 | 26篇 |
1994年 | 27篇 |
1993年 | 29篇 |
1992年 | 10篇 |
1991年 | 20篇 |
1990年 | 7篇 |
1989年 | 7篇 |
1988年 | 4篇 |
1987年 | 10篇 |
1986年 | 7篇 |
1985年 | 7篇 |
1984年 | 9篇 |
1983年 | 9篇 |
1982年 | 8篇 |
1981年 | 9篇 |
1980年 | 3篇 |
1979年 | 11篇 |
1978年 | 3篇 |
1976年 | 8篇 |
1975年 | 4篇 |
1971年 | 2篇 |
排序方式: 共有3544条查询结果,搜索用时 265 毫秒
91.
This paper proposes a mathematical model, valid inequalities and polyhedral results for the minimum labeling Hamiltonian cycle problem. This problem is defined on an unweighted graph in which each edge has a label. The aim is to determine a Hamiltonian cycle with the least number of labels. We also define two variants of this problem by assigning weights to the edges and by considering the tour length either as an objective or as a constraint. A branch-and-cut algorithm for the three problems is developed, and computational results are reported on randomly generated instances and on modified instances from TSPLIB. 相似文献
92.
Jérémie Bossu Nicolas Hautière Jean-Philippe Tarel 《International Journal of Computer Vision》2011,93(3):348-367
The detection of bad weather conditions is crucial for meteorological centers, specially with demand for air, sea and ground
traffic management. In this article, a system based on computer vision is presented which detects the presence of rain or
snow. To separate the foreground from the background in image sequences, a classical Gaussian Mixture Model is used. The foreground
model serves to detect rain and snow, since these are dynamic weather phenomena. Selection rules based on photometry and size
are proposed in order to select the potential rain streaks. Then a Histogram of Orientations of rain or snow Streaks (HOS),
estimated with the method of geometric moments, is computed, which is assumed to follow a model of Gaussian-uniform mixture.
The Gaussian distribution represents the orientation of the rain or the snow whereas the uniform distribution represents the
orientation of the noise. An algorithm of expectation maximization is used to separate these two distributions. Following
a goodness-of-fit test, the Gaussian distribution is temporally smoothed and its amplitude allows deciding the presence of
rain or snow. When the presence of rain or of snow is detected, the HOS makes it possible to detect the pixels of rain or
of snow in the foreground images, and to estimate the intensity of the precipitation of rain or of snow. The applications
of the method are numerous and include the detection of critical weather conditions, the observation of weather, the reliability
improvement of video-surveillance systems and rain rendering. 相似文献
93.
Jose A. Belloch Alberto Gonzalez F. J. Martínez-Zaldívar Antonio M. Vidal 《The Journal of supercomputing》2011,58(3):449-457
Massive convolution is the basic operation in multichannel acoustic signal processing. This field has experienced a major
development in recent years. One reason for this has been the increase in the number of sound sources used in playback applications
available to users. Another reason is the growing need to incorporate new effects and to improve the hearing experience. Massive
convolution requires high computing capacity. GPUs offer the possibility of parallelizing these operations. This allows us
to obtain the processing result in much shorter time and to free up CPU resources. One important aspect lies in the possibility
of overlapping the transfer of data from CPU to GPU and vice versa with the computation, in order to carry out real-time applications.
Thus, a synthesis of 3D sound scenes could be achieved with only a peer-to-peer music streaming environment using a simple
GPU in your computer, while the CPU in the computer is being used for other tasks. Nowadays, these effects are obtained in
theaters or funfairs at a very high cost, requiring a large quantity of resources. Thus, our work focuses on two mains points:
to describe an efficient massive convolution implementation and to incorporate this task to real-time multichannel-sound applications. 相似文献
94.
We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be
used in algorithm design and combinatorial analysis applying to both pathwidth and treewidth. We prove equivalence between
this game-theoretic approach and graph decompositions called q
-branched tree decompositions, which can be interpreted as a parameterized version of tree decompositions. Path decomposition and (standard)
tree decomposition are two extreme cases of q-branched tree decompositions. The equivalence between nondeterministic graph searching and q-branched tree decomposition enables us to design an exact (exponential time) algorithm computing q-branched treewidth for all q≥0, which is thus valid for both treewidth and pathwidth. This algorithm performs as fast as the best known exact algorithm
for pathwidth. Conversely, this equivalence also enables us to design a lower bound on the amount of nondeterminism required
to search a graph with the minimum number of searchers.
Additional support of F.V. Fomin by the Research Council of Norway.
Additional supports of P. Fraigniaud from the INRIA Project “Grand Large”, and from the Project PairAPair of the ACI “Masse de Données”.
Additional supports of N. Nisse from the Project Fragile of the ACI “Sécurité & Informatique”. 相似文献
95.
Xavier Maurice Anders Sandholm Nicolas Pronost Ronan Boulic Daniel Thalmann 《The Visual computer》2009,25(9):835-842
Today, to create and to simulate a virtual anatomical version of a subject is useful in the decision process of surgical treatments.
The muscular activity is one of the factors which can contribute to abnormal movements such as in spasticity or static contracture.
In this paper, we propose a numerical solution, based on the Finite Element (FE) method, able to estimate muscles deformations
during contraction. Organized around a finite element solver and a volumetric environment, this solution is made of all the
modeling and simulation processes from the discretization of the studied domain to the visualization of the results. The choices
of materials and properties of the FE model are also presented such as the hyperelasticity, the contention model based on
inter-meshes neighboring nodes pairing, and the estimation of nodal forces based on the subject-specific muscular forces and
action lines.
相似文献
Nicolas PronostEmail: |
96.
Fraigniaud et al. [L. Blin, P. Fraigniaud, N. Nisse, S. Vial, Distributing chasing of network intruders, in: 13th Colloquium on Structural Information and Communication Complexity, SIROCCO, in: LNCS, vol. 4056, Springer-Verlag, 2006, pp. 70–84] introduced a new measure of difficulty for a distributed task in a network. The smallest number of bits of advice of a distributed problem is the smallest number of bits of information that has to be available to nodes in order to accomplish the task efficiently. Our paper deals with the number of bits of advice required to perform efficiently the graph searching problem in a distributed setting. In this variant of the problem, all searchers are initially placed at a particular node of the network. The aim of the team of searchers is to clear a contaminated graph in a monotone connected way, i.e., the cleared part of the graph is permanently connected, and never decreases while the search strategy is executed. Moreover, the clearing of the graph must be performed using the optimal number of searchers, i.e. the minimum number of searchers sufficient to clear the graph in a monotone connected way in a centralized setting. We show that the minimum number of bits of advice permitting the monotone connected and optimal clearing of a network in a distributed setting is Θ(nlogn), where n is the number of nodes of the network. More precisely, we first provide a labelling of the vertices of any graph G, using a total of O(nlogn) bits, and a protocol using this labelling that enables the optimal number of searchers to clear G in a monotone connected distributed way. Then, we show that this number of bits of advice is optimal: any distributed protocol requires Ω(nlogn) bits of advice to clear a network in a monotone connected way, using an optimal number of searchers. 相似文献
97.
98.
99.
Claudio Schepke Nicolas Maillard Philippe O. A. Navaux 《International journal of parallel programming》2009,37(6):593-611
This paper presents and discusses a blocked parallel implementation of bi- and three-dimensional versions of the Lattice Boltzmann
Method. This method is used to represent and simulate fluid flows following a mesoscopic approach. Most traditional parallel
implementations use simple data distribution strategies to parallelize the operations on the regular fluid data set. However,
it is well known that block partitioning is usually better. Such a parallel implementation is discussed and its communication
cost is established. Fluid flows simulations crossing a cavity have also been used as a real-world case study to evaluate
our implementation. The presented results with our blocked implementation achieve a performance up to 31% better than non-blocked
versions, for some data distributions. Thus, this work shows that blocked, parallel implementations can be efficiently used
to reduce the parallel execution time of the method. 相似文献
100.
In this paper we explore the interest of computational intelligence tools in the management of heterogeneous communication networks, specifically to predict congestion, failures and other anomalies in the network that may eventually lead to degradation of the quality of offered services. We show two different applications based on neural and neuro-fuzzy systems for quality of service (QoS) management in next generation networks for voice and video service over heterogeneous Internet protocol (V2oIP) services. The two examples explained in this paper attempt to predict the communication network resources for new incoming calls, and visualizing the QoS of a communication network by means of self-organizing maps. 相似文献